HARDNESS AND APPROXIMATION OF GATHERING IN STATIC RADIO NETWORKS
نویسندگان
چکیده
منابع مشابه
Minimum Delay Data Gathering in Radio Networks
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbors at most one data item. Each device is equipped with a half duplex interface; so a node cannot both ...
متن کاملInformation Gathering in Ad-Hoc Radio Networks with Tree Topology
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complet...
متن کاملApproximation algorithms and the hardness of approximation
Chandra Chekuri (Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL), Joseph Cheriyan (Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, ON), Ryan O’Donnell (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA), Mohammad R. Salavatipour (Dept. of Computing Science, University of Alberta, Edmonton, AL), David Williamson (...
متن کاملApproximation Algorithms and Hardness of Approximation
S (in alphabetic order by speaker surname) Speaker: Hyung-Chan An (EPFL, Lausanne) Title: LP-Based Algorithms for Capacitated Facility Location Abstract: Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algori...
متن کاملApproximation Algorithms and Hardness of Approximation January
In the previous lecture we saw examples of greedy algorithms that made locally optimal decisions at each step to arrive at a solution that wasn’t too far from the optimal solution in the end. Specifically for the case of Set Cover we saw that this strategy leads to the best possible approximation algorithm we could hope for (unless NP ⊂ DTIME(n ), which is very unlikely). In general, we also no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2006
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626406002551